Reaching consensus on a connected graph
نویسندگان
چکیده
منابع مشابه
Reaching Approximate Byzantine Consensus in Partially-Connected Mobile Networks
We consider the problem of approximate consensus in mobile networks containing Byzantine nodes. We assume that each correct node can communicate only with its neighbors and has no knowledge of the global topology. As all nodes have moving ability, the topology is dynamic. The number of Byzantine nodes is bounded by f and known by all correct nodes. We first introduce an approximate Byzantine co...
متن کاملReaching Consensus on Decisions
We investigate how like-minded agents can reach consensus on their decisions even if they receive different information. The model used here was introduced by Aumann, and subsequently refined by Geanakoplos and Polemarchakis, Bacharach, Cave, Parikh and Krasucki ([Aum76,GP82,Cav83,Bac85,PK]). The main result is that when any number of like-minded agents communicate according to some fair protoc...
متن کاملIncreasing Peer Pressure on any Connected Graph Leads to Consensus
Justin Semonsen, ∗ Christopher Griffin, † Anna Squicciarini, ‡ and Sarah Rajtmajer § Department of Mathematics, Rutgers University, Piscataway, NJ 08854 2 Mathematics Department, United States Naval Academy, Annapolis, MD 21666 3 College of Info. Sci. and Tech., Penn State University, University Park, PA 16802 4 Quantitative Scientific Solutions, Arlington, VA 22203 (Dated: June 20, 2017 preprint)
متن کاملReaching a Consensus
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at . http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive...
متن کاملReaching Consensus on Social Networks
Research in sociology studies the effectiveness of social networks in achieving computational tasks. Typically the agents who are supposed to achieve a task are unaware of the underlying social network except their immediate friends. They have limited memory, communication, and coordination. These limitations result in computational obstacles in achieving otherwise trivial computational problem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Probability
سال: 2017
ISSN: 0021-9002,1475-6072
DOI: 10.1017/jpr.2016.94